Adaptive Selection of Primal Constraints for Isogeometric BDDC Deluxe Preconditioners
نویسندگان
چکیده
Isogeometric analysis has been introduced as an alternative to finite element methods in order to simplify the integration of CAD software and the discretization of variational problems of continuum mechanics. In contrast with the finite element case, the basis functions of isogeometric analysis are often not nodal. As a consequence, there are fat interfaces which can easily lead to an increase in the number of interface variables after a decomposition of the parameter space into subdomains. Building on earlier work on the deluxe version of the BDDC family of domain decomposition algorithms, several adaptive algorithms are here developed for scalar elliptic problems in an effort to decrease the dimension of the global, coarse component of these preconditioners. Numerical experiments provide evidence that this work can be successful, yielding scalable and quasi-optimal adaptive BDDC algorithms for isogeometric discretizations.
منابع مشابه
Isogeometric BDDC Preconditioners with Deluxe Scaling
A BDDC (Balancing Domain Decomposition by Constraints) preconditioner with a novel deluxe scaling, introduced by Dohrmann for problems with more than one variable coefficient, is extended to Isogeometric Analysis of scalar elliptic problems. This new scaling turns out to be much more powerful than BDDC with standard ρand stiffness scaling studied in a previous study of isogeometric BDDC. Our h-...
متن کاملAn Adaptive Choice of Primal Constraints for Bddc Domain Decomposition Algorithms
An adaptive choice for primal spaces, based on parallel sums, is developed for BDDC deluxe methods and elliptic problems in three dimensions. The primal space, which form the global, coarse part of the domain decomposition algorithm, and which is always required for any competitive algorithm, is defined in terms of generalized eigenvalue problems related to subdomain edges and faces; selected e...
متن کاملBDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields
A BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a new type...
متن کاملRobust BDDC Preconditioners for Reissner-Mindlin Plate Bending Problems and MITC Elements
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This BDDC algorithm is based on selecting the plate rotations and deflection degrees of freedom at the subdomain vertices as primal continuity constraints. After the implicit elimination of the interior degrees of freedom...
متن کاملBddc Preconditioners for Spectral Element Discretizations of Almost Incompressible Elasticity in Three Dimensions Tr2010-928
BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensions. Initially mixed spectral elements are employed to discretize the almost incompressible elasticity system, but a positive definite reformulation is obtained by eliminating all pressure degrees of freedom interior to each su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 39 شماره
صفحات -
تاریخ انتشار 2017